Optimal Referral Reward Considering Customer's Budget Constraint
نویسندگان
چکیده
Everyone likes Porsche but few can afford it. Budget constraints always play a critical role in a customer’s decision-making. The literature disproportionally focuses on how firms can induce customer valuations toward the product, but does not address how to assess the influence of budget constraints. We study these questions in the context of a referral reward program (RRP). RRP is a prominent marketing strategy that utilizes recommendations passed from existing customers to their friends and effectively stimulates word of mouth (WoM). We build a stylized game-theoretical model with a nested Stackelberg game involving three players: a firm, an existing customer, and a potential customer who is a friend of the existing customer. The budget is the friend’s private information. We show that RRPs might be optimal when the friend has either a low or a high valuation, but they work differently in each situation because of the budget. Furthermore, there are two budget thresholds, a fixed one and a variable one, which limit a firm’s ability to use rewards.
منابع مشابه
Optimizing referral reward programs under impression management considerations
We examine referral reward programs (RRP) that are intended for a service firm to encourage its current customers (inductors) to entice their friends (inductees) to purchase the firm’s service. By considering the interplay among the firm, the inductor, and the inductee, we solve a ‘‘nested’’ Stackelberg game so as to determine the optimal RRP in equilibrium. We determine the conditions under wh...
متن کاملA Multi-objective Hierarchical Location-allocation Model for the Healthcare Network Design Considering a Referral System
This paper presents a multi-objective and multi-service location-allocation model with capacity planning to design a healthcare facilities network through considering a referral system. Therefore, a mixed integer nonlinear programming (MINLP) model containing two objective functions is proposed. The first objective function is relates to minimization of total opening cost, minimization of tota...
متن کاملBudget Constrained Bidding by Model-free Reinforcement Learning in Display Advertising
Real-time bidding (RTB) is almost the most important mechanism in online display advertising, where proper bid for each page view plays a vital and essential role for good marketing results. Budget constrained bidding is a typical scenario in RTB mechanism where the advertisers hope to maximize total value of winning impressions under a pre-set budget constraint. However, the optimal strategy i...
متن کاملThe Lagrangian Relaxation Method for the Shortest Path Problem Considering Transportation Plans and Budgetary Constraint
In this paper, a constrained shortest path problem (CSP) in a network is investigated, in which some special plans for each link with corresponding pre-determined costs as well as reduction values in the link travel time are considered. The purpose is to find a path and selecting the best plans on its links, to improve the travel time as most as possible, while the costs of conducting plans do ...
متن کاملInfinitely Many-Armed Bandits with Budget Constraints
We study the infinitely many-armed bandit problem with budget constraints, where the number of arms can be infinite and much larger than the number of possible experiments. The player aims at maximizing his/her total expected reward under a budget constraint B for the cost of pulling arms. We introduce a weak stochastic assumption on the ratio of expected-reward to expected-cost of a newly pull...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Future Internet
دوره 7 شماره
صفحات -
تاریخ انتشار 2015